On polling systems with large setups
نویسنده
چکیده
Polling systems with large deterministic setup times find many applications in production environments. The present note studies the delay distribution in exhaustive polling systems when the setup times tend to infinity. Based on the recently proposed mean value analysis (MVA) for polling systems, a novel simple approach is developed to show that the scaled delay distribution converges to a uniform distribution. Since MVA is not limited to exhaustive polling systems, the analysis of the present note can be readily extended to a wide range of polling systems.
منابع مشابه
Response-time Approximations for Multi-server, Multi-class Production Systems with Significant Setups
A multi-server polling model is a queueing model where many order classes share a set of identical servers and a setup time is incurred whenever a server changes class. This paper develops approximations for the waiting time distribution in a multi-server polling model with cyclic serve-to-exhaustion service. These approximations are derived using previously established heavy-traac results and ...
متن کاملSetups in Polling Models: Does It Make Sense to Set up If No Work Is Waiting?
We compare two versions of a symmetric two-queue polling model with switchover times and setup times. The SI version has State-Independent setups, according to which the server sets up at the polled queue whether or not work is waiting there; and the SD version has State-Dependent setups, according to which the server sets up only when work is waiting at the polled queue. Naive intuition would ...
متن کاملSetting Basestock Levels in Multiproduct Systems with Setups and Random Yield
This paper shows how to set basestock levels in a multiproduct system with setups and random yield. The system is represented by a polling model and the inventory level of each product is controlled using a basestock policy. When the queue is empty, the inventory level is equal to the basestock level, thus the server will continue to serve the queue until it is empty. If the capacity of the que...
متن کاملFinite buffer polling models with routing
This paper analyzes a finite buffer polling system with routing. Finite buffers are used to model the limited capacity of the system, and routing is used to represent the need for additional service. The most significant result of the analysis is the derivation of the generating function for queue length when buffer sizes are limited and a representation of the system workload. The queue length...
متن کاملThe Economic Lot Scheduling Problem in Flow Lines with Sequence-Dependent Setups
The problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. Almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. In this paper we present a new mixed integer non linear program (MINLP) and a heuristic me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 35 شماره
صفحات -
تاریخ انتشار 2007